A Reduced Dantzig-Wolfe Decomposition for a Suboptimal Linear MPC
نویسندگان
چکیده
Linear Model Predictive Control (MPC) is an efficient control technique that repeatedly solves online constrained linear programs. In this work we propose an economic linear MPC strategy for operation of energy systems consisting of multiple and independent power units. These systems cooperate to meet the supply of power demand by minimizing production costs. The control problem can be formulated as a linear program with block-angular structure. To speed-up the solution of the optimization control problem, we propose a reduced Dantzig-Wolfe decomposition. This decomposition algorithm computes a suboptimal solution to the economic linear MPC control problem and guarantees feasibility and stability. Finally, six scenarios are performed to show the decrease in computation time in comparison with the classic Dantzig-Wolfe algorithm.
منابع مشابه
A Dantzig-Wolfe Decomposition Algorithm for Linear Economic MPC of a Power Plant Portfolio
Future power systems will consist of a large number of decentralized power producers and a large number of controllable power consumers in addition to stochastic power producers such as wind turbines and solar power plants. Control of such large scale systems requires new control algorithms. In this paper, we formulate the control of such a system as an Economic Model Predictive Control (MPC) p...
متن کاملEarly Termination of Dantzig-Wolfe Algorithm for Economic MPC
In this paper we apply the Economic Model Predictive Control (MPC) for balancing the power supply and demand in the future power systems in the most economic way. The control problem is formulated as a linear program, having a block-angular structure solved by the implementation of the Dantzig-Wolfe decomposition. For real-time applications we introduce an early termination technique. Simulatio...
متن کاملA Dantzig-Wolfe Decomposition Algorithm for Economic MPC of Distributed Energy Systems
In economic model predictive control of distributed energy systems, the constrained optimal control problem can be expressed as a linear program with a block-angular structure. In this paper, we present an efficient Dantzig-Wolfe decomposition algorithm specifically tailored to problems of this type. Simulations show that a MATLAB implementation of the algorithm is significantly faster than sev...
متن کاملDantzig-wolfe Decomposition and Large-scale Constrained Mpc Problems
Model Predictive Control (MPC) strategies are typically implemented in two levels: a steady-state target calculation and a control calculation. The steady-state target calculation consumes excess degrees of freedom within the control problem to provide optimal steady-state performance with respect to some specified objective. In some MPC approaches, the target calculation is formulated as a Lin...
متن کاملSimplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints
The simplicial decomposition (SD) subproblem for a nonlinear multicommodity network ow problem is simply its linear approximation. Instead of solving the subproblem optimally, this paper demonstrates that performing one iteration of Dantzig– Wolfe decomposition is generally su cient for SD to e ciently converge to an optimal solution. c © 2000 Elsevier Science B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014